Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems
نویسندگان
چکیده
The sequential circuit state space diameter problem is an important problem in sequential verification. Bounded model checking is complete if the state space diameter of the system is known. By unrolling the transition relation, the sequential circuit state space diameter problem can be formulated as an evaluation for satisfiability of a Quantified Boolean Formula (QBF). This has prompted research in QBFs in the verification community. Most of existing QBF algorithms, such as those based on the DPLL SAT algorithm, are search based. We show that using search based QBF algorithms to calculate the state space diameter of sequential circuits with existing problem formulations is no better than an explicit state space enumeration method. This result holds independent of the representation of the QBF formula. This result is important as it highlights the need to explore non-search based or hybrid of search and non-search based QBF algorithms for the sequential circuit state space diameter problem.
منابع مشابه
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems
متن کامل
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
We study algorithms for the satisfiability problem for quantified Boolean formulas (QBFs), and consequences of faster algorithms for circuit complexity. • We show that satisfiability of quantified 3-CNFs with m clauses, n variables, and two quantifier blocks (one existential block and one universal) can be solved deterministically in time 2n−Ω( √ n) · poly(m). For the case of multiple quantifie...
متن کاملNew Algorithms for QBF Satisfiability and Implications for Circuit Complexity
We revisit the complexity of the satisfiability problem for quantified Boolean formulas. We show that satisfiability of quantified CNFs of size poly(n) on n variables with O(1) quantifier blocks can be solved in time 2n−n Ω(1) by zero-error randomized algorithms. This is the first known improvement over brute force search in the general case, even for quantified polynomial-sized CNFs with one a...
متن کاملA Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as instances of 2QBF. Techniques that are not applicable to general QBF evaluation may be useful for 2QBF evaluation. In particular, decision order in search based algorithms may not obey quantification order for 2QBF evalua...
متن کاملConnectivity of Boolean satisfiability
In this thesis we are concerned with the solution-space structure of Boolean satisfiability problems, from the view of theoretical computer science, especially complexity theory. We consider the solution graph of Boolean formulas; this is the graph where the vertices are the solutions of the formula, and two solutions are connected iff they differ in the assignment of exactly one variable. For ...
متن کامل